Using Binary Decision Diagrams to Determine Program Equivalence in a Superoptimizer
نویسندگان
چکیده
A superoptimizer is a tool capable of generating an optimal program that computes a desired function. This thesis describes a superoptimizer that uses binary decision diagrams to determine if a generated candidate programs is equivalent to a given target program known to compute the desired function. The superoptimizer is shown to work well for generating program consisting of instructions no more complex than addition, but to perform poorly for programs containing multiplication instructions.
منابع مشابه
Probabilistic manipulation of Boolean functions using free Boolean diagrams
We propose a data structure for Boolean functions termed the Free Boolean Diagram. A Free Boolean Diagram allows decision vertices as in the conventional Binary Decision Diagram, but also allows function vertices corresponding to the and and xor functions. It has been shown previously that the equivalence of two Free Boolean Diagrams can be decided probabilistically in polynomial time. Based on...
متن کاملBinary Decision Diagrams
A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...
متن کاملLearning Ordered Binary Decision Diagrams
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...
متن کاملTesting Equivalence Probabilistically
Although the equivalence of two Ordered Binary Decision Diagrams (OBDDs) can be decided in polynomial time, the equivalence of two Free Binary Decision Diagrams (FBDDs) is only known to be probabilistically decidable in polynomial time. FBDDs are a strict superset of OBDDs, and are more succinct than OBDDs, which explains the interest in testing their equivalence. We show that the probabilistic...
متن کاملSymbolic Solver for Live Variable Analysis of High Level Design Languages
This paper presents an efficient binary decision diagram solver for live variable analysis of high level design languages like SpecC. A novel representation of the program as a global structure using efficient data structure called Binary Decision Diagrams is presented. Based on the global structure of the program, a relational framework for live variable analysis is proposed and the solver alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012